Homogeneity and omega-categoricity of semigroups

In this thesis we study problems in the theory of semigroups which arise from model theoretic notions. Our focus will be on omega-categoricity and homogeneity of semigroups, a common feature of both of these properties being symmetricity. A structure is homogeneous if every local symmetry can be extended to a global symmetry, and as such it will have a rich automorphism group. On the other hand, the Ryll-Nardzewski Theorem dictates that omega-categorical structures have oligomorphic automorphism groups. Numerous authors have investigated the homogeneity and omega-categoricity of algebras including groups, rings, and of relational structures such as graphs and posets. The central aim of this thesis is to forge a new path through the model theory of semigroups. The main body of this thesis is split into two parts. The first is an exploration into omega-categoricity of semigroups. We follow the usual semigroup theoretic method of analysing Green's relations on an omega-categorical semigroup, and prove a finiteness condition on their classes. This work motivates a generalization of characteristic subsemigroups, and subsemigroups of this form are shown to inherit omega-categoricity. We also explore methods for building omega-categorical semigroups from given omega-categorical structures. In the second part we study the homogeneity of certain classes of semigroups, with an emphasis on completely regular semigroups. A complete description of all homogeneous bands is achieved, which shows them to be regular bands with homogeneous structure semilattices. We also obtain a partial classification of homogeneous inverse semigroups. A complete description can be given in a number of cases, including inverse semigroups with finite maximal subgroups, and periodic commutative inverse semigroups. These results extend the classification of homogeneous semilattices by Droste, Truss, and Kuske. We pose a number of open problems, that we believe will open up a rich subsequent stream of research

On minimal ideals in pseudo-finite semigroups

This work was supported by the Engineering and Physical Sciences Research Council [EP/V002953/1].A semigroup S is said to be right pseudo-finite if the universal right congruence can be generated by a finite set U⊆S×S, and there is a bound on the length of derivations for an arbitrary pair (s,t)∈S×S as a consequence of those in U. This article explores the existence and nature of a minimal ideal in a right pseudo-finite semigroup. Continuing the theme started in an earlier work by Dandan et al., we show that in several natural classes of monoids, right pseudo-finiteness implies the existence of a completely simple minimal ideal. This is the case for orthodox monoids, completely regular monoids and right reversible monoids, which include all commutative monoids. We also show that certain other conditions imply the existence of a minimal ideal, which need not be completely simple; notably, this is the case for semigroups in which one of the Green's pre-orders ≤L or ≤J is left compatible with multiplication. Finally, we establish a number of examples of pseudo-finite monoids without a minimal ideal. We develop an explicit construction that yields such examples with additional desired properties, for instance, regularity or J-triviality.PostprintPeer reviewe

On minimal ideals in pseudo-finite semigroups

A semigroup $S$ is said to be right pseudo-finite if the universal right congruence can be generated by a finite set $U\subseteq S\times S$, and there is a bound on the length of derivations for an arbitrary pair $(s,t)\in S\times S$ as a consequence of those in $U$. This article explores the existence and nature of a minimal ideal in a right pseudo-finite semigroup. Continuing the theme started in an earlier work by Dandan et al., we show that in several natural classes of monoids, right pseudo-finiteness implies the existence of a completely simple minimal ideal. This is the case for orthodox monoids, completely regular monoids and right reversible monoids, which include all commutative monoids. We also show that certain other conditions imply the existence of a minimal ideal, which need not be completely simple; notably, this is the case for semigroups in which one of the Green's pre-orders $\leq_{\mathcal{L}}$ or $\leq_{\mathcal{J}}$ is left compatible with multiplication. Finally, we establish a number of examples of pseudo-finite monoids without a minimal ideal. We develop an explicit construction that yields such examples with additional desired properties, for instance, regularity or $\mathcal{J}$-triviality

Semigroups with finitely generated universal left congruence

We consider semigroups such that the universal left congruence ω ℓ is finitely generated. Certainly a left noetherian semigroup, that is, one in which all left congruences are finitely generated, satisfies our condition. In the case of a monoid the condition that ω ℓ is finitely generated is equivalent to a number of pre-existing notions. In particular, a monoid satisfies the homological finiteness condition of being of type left-FP 1 exactly when ω ℓ is finitely generated. Our investigations enable us to classify those semigroups such that ω ℓ is finitely generated that lie in certain important classes, such as strong semilattices of semigroups, inverse semigroups, Rees matrix semigroups (over semigroups) and completely regular semigroups. We consider closure properties for the class of semigroups such that ω ℓ is finitely generated, including under morphic image, direct product, semi-direct product, free product and 0-direct union. Our work was inspired by the stronger condition, stated for monoids in the work of White, of being pseudo-finite. Where appropriate, we specialise our investigations to pseudo-finite semigroups and monoids. In particular, we answer a question of Dales and White concerning the nature of pseudo-finite monoids